0.07/0.11	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_E %s %d THM
0.12/0.34	% Computer : n029.cluster.edu
0.12/0.34	% Model    : x86_64 x86_64
0.12/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.12/0.34	% Memory   : 8042.1875MB
0.12/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.12/0.34	% CPULimit   : 960
0.12/0.34	% WCLimit    : 120
0.12/0.34	% DateTime   : Tue Aug  9 02:45:54 EDT 2022
0.12/0.34	% CPUTime    : 
0.20/0.46	Running higher-order on 8 cores theorem proving
0.20/0.46	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.47	# Version: 3.0pre003-ho
0.20/0.47	# Preprocessing class: HSSSSMSSMLMNHSN.
0.20/0.47	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.47	# Starting new_ho_10 with 600s (5) cores
0.20/0.47	# Starting sh5l with 120s (1) cores
0.20/0.47	# Starting new_bool_1 with 120s (1) cores
0.20/0.47	# Starting new_bool_2 with 120s (1) cores
0.20/0.47	# sh5l with pid 22595 completed with status 0
0.20/0.47	# Result found by sh5l
0.20/0.47	# Preprocessing class: HSSSSMSSMLMNHSN.
0.20/0.47	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.47	# Starting new_ho_10 with 600s (5) cores
0.20/0.47	# Starting sh5l with 120s (1) cores
0.20/0.47	# SinE strategy is gf500_gu_R04_F100_L20000
0.20/0.47	# ...ProofStateSinE()=8/29
0.20/0.47	# Search class: HGUNF-FFSF22-SHSSMFNN
0.20/0.47	# partial match(1): HGHNF-FFSF22-SHSSMFNN
0.20/0.47	# Scheduled 5 strats onto 1 cores with 120 seconds (120 total)
0.20/0.47	# Starting new_ho_10 with 73s (1) cores
0.20/0.47	# new_ho_10 with pid 22603 completed with status 0
0.20/0.47	# Result found by new_ho_10
0.20/0.47	# Preprocessing class: HSSSSMSSMLMNHSN.
0.20/0.47	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.47	# Starting new_ho_10 with 600s (5) cores
0.20/0.47	# Starting sh5l with 120s (1) cores
0.20/0.47	# SinE strategy is gf500_gu_R04_F100_L20000
0.20/0.47	# ...ProofStateSinE()=8/29
0.20/0.47	# Search class: HGUNF-FFSF22-SHSSMFNN
0.20/0.47	# partial match(1): HGHNF-FFSF22-SHSSMFNN
0.20/0.47	# Scheduled 5 strats onto 1 cores with 120 seconds (120 total)
0.20/0.47	# Starting new_ho_10 with 73s (1) cores
0.20/0.47	# Preprocessing time       : 0.001 s
0.20/0.47	# Presaturation interreduction done
0.20/0.47	
0.20/0.47	# Proof found!
0.20/0.47	# SZS status Theorem
0.20/0.47	# SZS output start CNFRefutation
0.20/0.47	thf(decl_22, type, mrel: mworld > mworld > $o).
0.20/0.47	thf(decl_23, type, mactual: mworld).
0.20/0.47	thf(decl_24, type, mlocal: (mworld > $o) > $o).
0.20/0.47	thf(decl_25, type, mnot: (mworld > $o) > mworld > $o).
0.20/0.47	thf(decl_26, type, mand: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.47	thf(decl_27, type, mor: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.47	thf(decl_28, type, mimplies: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.47	thf(decl_29, type, mequiv: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.47	thf(decl_30, type, mbox: (mworld > $o) > mworld > $o).
0.20/0.47	thf(decl_31, type, mdia: (mworld > $o) > mworld > $o).
0.20/0.47	thf(decl_32, type, mforall_di: ($i > mworld > $o) > mworld > $o).
0.20/0.47	thf(decl_33, type, mexists_di: ($i > mworld > $o) > mworld > $o).
0.20/0.47	thf(decl_34, type, member: $i > $i > mworld > $o).
0.20/0.47	thf(decl_35, type, subset: $i > $i > mworld > $o).
0.20/0.47	thf(decl_36, type, esk1_0: $i).
0.20/0.47	thf(decl_37, type, esk2_0: $i).
0.20/0.47	thf(decl_38, type, esk3_0: $i).
0.20/0.47	thf(decl_39, type, esk4_2: $i > $i > $i).
0.20/0.47	thf(mlocal_def, axiom, ((mlocal)=(^[X1:mworld > $o]:((X1 @ mactual)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mlocal_def)).
0.20/0.47	thf(mequiv_def, axiom, ((mequiv)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)<=>(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mequiv_def)).
0.20/0.47	thf(mimplies_def, axiom, ((mimplies)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)=>(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mimplies_def)).
0.20/0.47	thf(mforall_di_def, axiom, ((mforall_di)=(^[X6:$i > mworld > $o, X3:mworld]:(![X7:$i]:((X6 @ X7 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mforall_di_def)).
0.20/0.47	thf(mand_def, axiom, ((mand)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)&(X4 @ X3))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', mand_def)).
0.20/0.47	thf(subset_defn, axiom, (mlocal @ (mforall_di @ (^[X9:$i]:(mforall_di @ (^[X10:$i]:(mequiv @ (subset @ X9 @ X10) @ (mforall_di @ (^[X11:$i]:(mimplies @ (member @ X11 @ X9) @ (member @ X11 @ X10)))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', subset_defn)).
0.20/0.47	thf(prove_transitivity_of_subset, conjecture, (mlocal @ (mforall_di @ (^[X13:$i]:(mforall_di @ (^[X10:$i]:(mforall_di @ (^[X11:$i]:(mimplies @ (mand @ (subset @ X13 @ X10) @ (subset @ X10 @ X11)) @ (subset @ X13 @ X11))))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', prove_transitivity_of_subset)).
0.20/0.47	thf(c_0_7, plain, ((mlocal)=(^[Z0:mworld > $o]:((Z0 @ mactual)))), inference(fof_simplification,[status(thm)],[mlocal_def])).
0.20/0.47	thf(c_0_8, plain, ((mequiv)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)<=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mequiv_def])).
0.20/0.47	thf(c_0_9, plain, ((mimplies)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies_def])).
0.20/0.47	thf(c_0_10, plain, ((mforall_di)=(^[Z0:$i > mworld > $o, Z1:mworld]:(![X7:$i]:((Z0 @ X7 @ Z1))))), inference(fof_simplification,[status(thm)],[mforall_di_def])).
0.20/0.47	thf(c_0_11, plain, ((mand)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)&(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mand_def])).
0.20/0.47	thf(c_0_12, plain, ![X19:$i, X18:$i]:(((subset @ X19 @ X18 @ mactual)<=>![X17:$i]:(((member @ X17 @ X19 @ mactual)=>(member @ X17 @ X18 @ mactual))))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[subset_defn]), c_0_7]), c_0_8]), c_0_9]), c_0_10])).
0.20/0.47	thf(c_0_13, negated_conjecture, ~(![X16:$i, X15:$i, X14:$i]:((((subset @ X16 @ X15 @ mactual)&(subset @ X15 @ X14 @ mactual))=>(subset @ X16 @ X14 @ mactual)))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[prove_transitivity_of_subset])]), c_0_7]), c_0_11]), c_0_9]), c_0_10])).
0.20/0.47	thf(c_0_14, plain, ![X24:$i, X25:$i, X26:$i, X27:$i, X28:$i]:(((~(subset @ X24 @ X25 @ mactual)|(~(member @ X26 @ X24 @ mactual)|(member @ X26 @ X25 @ mactual)))&(((member @ (esk4_2 @ X27 @ X28) @ X27 @ mactual)|(subset @ X27 @ X28 @ mactual))&(~(member @ (esk4_2 @ X27 @ X28) @ X28 @ mactual)|(subset @ X27 @ X28 @ mactual))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])])])])).
0.20/0.47	thf(c_0_15, negated_conjecture, (((subset @ esk1_0 @ esk2_0 @ mactual)&(subset @ esk2_0 @ esk3_0 @ mactual))&~(subset @ esk1_0 @ esk3_0 @ mactual)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])])).
0.20/0.47	thf(c_0_16, plain, ![X10:$i, X9:$i, X7:$i]:(((member @ X10 @ X9 @ mactual)|~((subset @ X7 @ X9 @ mactual))|~((member @ X10 @ X7 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.47	thf(c_0_17, negated_conjecture, (subset @ esk2_0 @ esk3_0 @ mactual), inference(split_conjunct,[status(thm)],[c_0_15])).
0.20/0.47	thf(c_0_18, plain, ![X7:$i, X9:$i]:(((subset @ X7 @ X9 @ mactual)|~((member @ (esk4_2 @ X7 @ X9) @ X9 @ mactual)))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.47	thf(c_0_19, negated_conjecture, ![X7:$i]:(((member @ X7 @ esk3_0 @ mactual)|~((member @ X7 @ esk2_0 @ mactual)))), inference(spm,[status(thm)],[c_0_16, c_0_17])).
0.20/0.47	thf(c_0_20, negated_conjecture, (subset @ esk1_0 @ esk2_0 @ mactual), inference(split_conjunct,[status(thm)],[c_0_15])).
0.20/0.47	thf(c_0_21, negated_conjecture, ![X7:$i]:(((subset @ X7 @ esk3_0 @ mactual)|~((member @ (esk4_2 @ X7 @ esk3_0) @ esk2_0 @ mactual)))), inference(spm,[status(thm)],[c_0_18, c_0_19])).
0.20/0.47	thf(c_0_22, negated_conjecture, ![X7:$i]:(((member @ X7 @ esk2_0 @ mactual)|~((member @ X7 @ esk1_0 @ mactual)))), inference(spm,[status(thm)],[c_0_16, c_0_20])).
0.20/0.47	thf(c_0_23, negated_conjecture, ![X7:$i]:(((subset @ X7 @ esk3_0 @ mactual)|~((member @ (esk4_2 @ X7 @ esk3_0) @ esk1_0 @ mactual)))), inference(spm,[status(thm)],[c_0_21, c_0_22])).
0.20/0.47	thf(c_0_24, plain, ![X7:$i, X9:$i]:(((member @ (esk4_2 @ X7 @ X9) @ X7 @ mactual)|(subset @ X7 @ X9 @ mactual))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.20/0.47	thf(c_0_25, negated_conjecture, ~((subset @ esk1_0 @ esk3_0 @ mactual)), inference(split_conjunct,[status(thm)],[c_0_15])).
0.20/0.47	thf(c_0_26, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_24]), c_0_25]), ['proof']).
0.20/0.47	# SZS output end CNFRefutation
0.20/0.47	# Parsed axioms                        : 29
0.20/0.47	# Removed by relevancy pruning/SinE    : 21
0.20/0.47	# Initial clauses                      : 7
0.20/0.47	# Removed in clause preprocessing      : 0
0.20/0.47	# Initial clauses in saturation        : 7
0.20/0.47	# Processed clauses                    : 19
0.20/0.47	# ...of these trivial                  : 0
0.20/0.47	# ...subsumed                          : 0
0.20/0.47	# ...remaining for further processing  : 19
0.20/0.47	# Other redundant clauses eliminated   : 0
0.20/0.47	# Clauses deleted for lack of memory   : 0
0.20/0.47	# Backward-subsumed                    : 0
0.20/0.47	# Backward-rewritten                   : 0
0.20/0.47	# Generated clauses                    : 10
0.20/0.47	# ...of the previous two non-redundant : 5
0.20/0.47	# ...aggressively subsumed             : 0
0.20/0.47	# Contextual simplify-reflections      : 0
0.20/0.47	# Paramodulations                      : 10
0.20/0.47	# Factorizations                       : 0
0.20/0.47	# NegExts                              : 0
0.20/0.47	# Equation resolutions                 : 0
0.20/0.47	# Propositional unsat checks           : 0
0.20/0.47	#    Propositional check models        : 0
0.20/0.47	#    Propositional check unsatisfiable : 0
0.20/0.47	#    Propositional clauses             : 0
0.20/0.47	#    Propositional clauses after purity: 0
0.20/0.47	#    Propositional unsat core size     : 0
0.20/0.47	#    Propositional preprocessing time  : 0.000
0.20/0.47	#    Propositional encoding time       : 0.000
0.20/0.47	#    Propositional solver time         : 0.000
0.20/0.47	#    Success case prop preproc time    : 0.000
0.20/0.47	#    Success case prop encoding time   : 0.000
0.20/0.47	#    Success case prop solver time     : 0.000
0.20/0.47	# Current number of processed clauses  : 12
0.20/0.47	#    Positive orientable unit clauses  : 3
0.20/0.47	#    Positive unorientable unit clauses: 0
0.20/0.47	#    Negative unit clauses             : 1
0.20/0.47	#    Non-unit-clauses                  : 8
0.20/0.47	# Current number of unprocessed clauses: 0
0.20/0.47	# ...number of literals in the above   : 0
0.20/0.47	# Current number of archived formulas  : 0
0.20/0.47	# Current number of archived clauses   : 7
0.20/0.47	# Clause-clause subsumption calls (NU) : 9
0.20/0.47	# Rec. Clause-clause subsumption calls : 9
0.20/0.47	# Non-unit clause-clause subsumptions  : 0
0.20/0.47	# Unit Clause-clause subsumption calls : 0
0.20/0.47	# Rewrite failures with RHS unbound    : 0
0.20/0.47	# BW rewrite match attempts            : 6
0.20/0.47	# BW rewrite match successes           : 0
0.20/0.47	# Condensation attempts                : 19
0.20/0.47	# Condensation successes               : 0
0.20/0.47	# Termbank termtop insertions          : 1238
0.20/0.47	
0.20/0.47	# -------------------------------------------------
0.20/0.47	# User time                : 0.007 s
0.20/0.47	# System time              : 0.000 s
0.20/0.47	# Total time               : 0.007 s
0.20/0.47	# Maximum resident set size: 1920 pages
0.20/0.47	
0.20/0.47	# -------------------------------------------------
0.20/0.47	# User time                : 0.009 s
0.20/0.47	# System time              : 0.001 s
0.20/0.47	# Total time               : 0.010 s
0.20/0.47	# Maximum resident set size: 1744 pages
0.20/0.47	EOF